- multigraphs
- Макаров: мультиграфы
Универсальный англо-русский словарь. Академик.ру. 2011.
multigraphs
Смотреть что такое "multigraphs" в других словарях:
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Multigraph — Pseudograph redirects here. It is not to be confused with Pseudepigraph. This article is about the mathematical concept. For other uses, see Multigraph (disambiguation). A multigraph with multiple edges (red) and several loops (blue). Not all… … Wikipedia
Kirchhoff's theorem — In the mathematical field of graph theory Kirchhoff s theorem or Kirchhoff s matrix tree theorem named after Gustav Kirchhoff is a theorem about the number of spanning trees in a graph. It is a generalization of Cayley s formula which provides… … Wikipedia
Jan Tschichold — in 1963 Jan Tschichold (2 April 1902 Leipzig, Germany – 11 August 1974 Locarno, Switzerland) was a typographer, book designer, teacher and writer. Contents … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
Incidence matrix — In mathematics, an incidence matrix is a matrix that shows the relationship between two classes of objects. If the first class is X and the second is Y, the matrix has one row for each element of X and one column for each element of Y. The entry… … Wikipedia
Line graph — This article is about the mathematical concept. For statistical presentation method, see line chart. In graph theory, the line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Matrix addition — In mathematics, matrix addition is the operation of adding two matrices by adding the corresponding entries together. However, there are other operations which could also be considered as a kind of addition for matrices, the direct sum and the… … Wikipedia
Hungarian alphabet — The Hungarian alphabet is an extension of the Latin alphabet.One sometimes speaks of the smaller and greater Hungarian alphabet, depending on whether the letters Q, W, X, Y which can only be found in foreign words and traditional orthography of… … Wikipedia
List edge-coloring — In mathematics, list edge coloring is a type of graph coloring.More precisely, a list edge coloring is a choice function that maps every edge to a color from a prescribed list for that edge.A graph is k edge choosable if it has a proper list edge … Wikipedia
